Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
نویسندگان
چکیده
منابع مشابه
Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
This study examines two different barrier functions and their use in both path-following and potential-reduction interior-point algorithms for solving a linear program of the form: minimize cTZ subject to Az = b and e < z < u, where components of e and u can be nonfinite, so the variables z can have 0-, 1-,or 2-sided bounds, j = 1, ..., n. The barrier functions that we study include an extensio...
متن کاملNew Interior Point Algorithms in Linear Programming †
In this paper the abstract of the thesis ”New Interior Point Algorithms in Linear Programming” is presented. The purpose of the thesis is to elaborate new interior point algorithms for solving linear optimization problems. The theoretical complexity of the new algorithms are calculated. We also prove that these algorithms are polynomial. The thesis is composed of seven chapters. In the first ch...
متن کاملSolving Fully Fuzzy Linear Programming Problems with Zero-One Variables by Ranking Function
Jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables. In this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.
متن کاملModified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
We investigate a modi ed Cholesky algorithm typical of those used in most interiorpoint codes for linear programming. Cholesky-based interior-point codes are popular for three reasons: their implementation requires only minimal changes to standard sparse Cholesky algorithms (allowing us to take full advantage of software written by specialists in that area); they tend to be more e cient than co...
متن کاملComputing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
A typical example of the quadratic assignment problem (QAP) is the facility location problem, in which a set of n facilities are to be assigned, at minimum cost, to an equal number of locations. Between each pair of facilities, there is a given amount of flow, contributing a cost equal to the product of the flow and the distance between locations to which the facilities are assigned. Proving op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1995
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.20.2.415